Algebraic curves and cryptography
نویسندگان
چکیده
Algebraic curves over finite fields are being extensively used in the design of public-key cryptographic schemes. This paper surveys some topics in algebraic curve cryptography, with an emphasis on recent developments in algorithms for the elliptic and hyperelliptic curve discrete logarithm problems, and computational problems in pairing-based cryptography.
منابع مشابه
Universal Hashing and Geometric Codes
We describe a new application of algebraic coding theory to universal hashing and authentication without secrecy. This permits to make use of the hitherto sharpest weapon of coding theory, the construction of codes from algebraic curves. We show in particular how codes derived from Artin-Schreier curves, Hermitian curves and Suzuki curves yield classes of universal hash functions which are subs...
متن کاملComputer algebra and geometry – some interactions
Algebraic curves and surfaces have been studied intensively in algebraic geometry for centuries. Thus, there exists a huge amount of theoretical knowledge about these geometric objects. Recently, algebraic curves and surfaces play an important and ever increasing rôle in computer aided geometric design, computer vision, computer aided manufacturing, coding theory, and cryptography, just to name...
متن کاملCurves in Projective Spaces and Almost MDS Codes
A k-track in PG(n, q) is a set of k points such that every n of them are in general position. Here, we construct a class of n-tracks arising from algebraic curves.
متن کاملStudy of Finite Field over Elliptic Curve: Arithmetic Means
Public key cryptography systems are based on sound mathematical foundations that are designed to make the problem hard for an intruder to break into the system. Number theory and algebraic geometry, namely the theory of elliptic curves defined over finite fields, has found applications in cryptology. The basic reason for this is that elliptic curves over finite fields provide an inexhaustible s...
متن کاملA new implementation of Miura-Arita algorithm for Miura curves
The aim of this paper is to review some of standard fact on Miura curves. We give some easy theorem in number theory to define Miura curves, then we present a new implementation of Arita algorithm for Miura curves. Keywords—Miura curve, discrete logarithm problem, algebraic curve cryptography, Jacobian group.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Finite Fields and Their Applications
دوره 11 شماره
صفحات -
تاریخ انتشار 2005